Artin's Conjecture and Size of Finite Probabilistic Automata
نویسنده
چکیده
Size (the number of states) of finite probabilistic automata with an isolated cut-point can be exponentially smaller than the size of any equivalent finite deterministic automaton. The result is presented in two versions. The first version depends on Artin’s Conjecture (1927) in Number Theory. The second version does not depend on conjectures but the numerical estimates are worse. In both versions the method of the proof does not allow an explicit description of the languages used. Since our finite probabilistic automata are reversible, these results imply a similar result for quantum finite automata.
منابع مشابه
Analogues of Artin's Conjecture by Larry
Artin's celebrated conjecture on primitive roots (Artin [l, p. viii], Hasse [2], Hooley [3]) suggests the following Conjecture. Let S' be a set of rational primes. For each q£-S, let Lq be an algebraic number field of degree n(q). For every square-f ree integer k, divisible only by primes of S, define Lk to be the composite of all Lq, q\ k, and denote n{k) =deg(Ljb/0). Assume that 2 * l/n(k) co...
متن کاملOne-Counter Verifiers for Decidable Languages
Condon and Lipton (FOCS 1989) showed that the class of languages having a space-bounded interactive proof system (IPS) is a proper subset of decidable languages, where the verifier is a probabilistic Turing machine. In this paper, we show that if we use architecturally restricted verifiers instead of restricting the working memory, i.e. replacing the working tape(s) with a single counter, we ca...
متن کاملDeterministic moles cannot solve liveness
We examine the conjecture that no polynomial can upper bound the increase in the number of states when a one-way nondeterministic finite automaton (1nfa) is converted into an equivalent two-way deterministic finite automaton (2dfa). We study the problem of liveness, which admits 1nfas of polynomial size and is known to defy 2dfas of polynomial size if and only if the conjecture is true. We focu...
متن کاملAxiomatizations for Probabilistic Finite-State Behaviors
We study a process calculus which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s probabilistic automata. We consider various strong and weak behavioral equivalences, and we provide complete axiomatizations for finite-state processes, restricted to guarded definitions in case of the weak equivalences. We conjecture that in the general case of unguard...
متن کاملProbabilistic and Nondeterministic Unary Automata
We investigate unary regular languages and compare deterministic finite automata (DFA’s), nondeterministic finite automata (NFA’s) and probabilistic finite automata (PFA’s) with respect to their size. Given a unary PFA with n states and an -isolated cutpoint, we show that the minimal equivalent DFA has at most n 1 2 states in its cycle. This result is almost optimal, since for any α < 1 a famil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008